A New Self-balancing SDPSO Algorithm for Solving University Path Problem

doi:10.3969/j.issn.1006-2475.2012.06.005

Computer and Modernization ›› 2012, Vol. 1 ›› Issue (6): 17-19,3.doi: 10.3969/j.issn.1006-2475.2012.06.005

• 人工智能 • Previous Articles Next Articles

A New Self-balancing SDPSO Algorithm for Solving University Path Problem

FANG Xin

Department of Electronic and Information Engineering, Ankang University, Ankang 725000, China

Received:2012-02-15 Revised:1900-01-01 Online:2012-06-14 Published:2012-06-14

Abstract

Abstract: According to PSO algorithm and using actual university geographic coordinates, taking discrete PSO algorithm as the core and combining with combinatorial optimization TSP, the paper proposes a new self-balancing mechanism to solve the university shortest path as SDPSO. System development uses Visual Studio 2005, MapInfo8.0, MapX5.0 to get algorithm result. Experimental results show that SDPSO not only can solve actual path problem, but also has better self-balancing search capability, the original performance is improved.

Key words: self-balancing mechanism, SDPSO algorithm, university path

CLC Number:

TP301

FANG Xin. A New Self-balancing SDPSO Algorithm for Solving University Path Problem[J]. Computer and Modernization, 2012, 1(6): 17-19,3.

[1]	FANG Xin. New Hybrid PSO Algorithm of Inverted Sequence Variation to Solve University Path [J]. Computer and Modernization, 2012, 1(9): 143-146.
[2]	FANG Xin. A New Parallel Selfbalancing PSO Algorithm with Data Integer Programming [J]. Computer and Modernization, 2012, 203(7): 17-20.
[3]	FANG Xin. Research and Application of Parallel Hybrid PSO Algorithm of Positive Sequence Variation [J]. Computer and Modernization, 2012, 8(08): 13-16.

A New Self-balancing SDPSO Algorithm for Solving University Path Problem

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 3

Recommended Articles

Metrics

Comments